The loop free logical topology created is called a tree 没有?圈的逻辑拓扑叫做树。
2.
The algorithm used to create this loop free logical topology is the spanning - tree algorithm 用来建立没有?圈的逻辑拓扑之演算法通常称为扩充树演算法。
3.
It is because certain paths are blocked that a loop free topology is possible . data frames received on blocked links are dropped 因为某些特定的路径被阻隔,所以才有可能建立没有?圈的拓扑。在阻隔连结上所收到的资料讯框将被丢弃。
4.
A new algorithm called the rapid spanning - tree algorithm was developed to reduce the time for a network to compute a loop free logical topology 一个新的演算法叫做快速扩充树演算法,是开发用来减少网路上,计算一个没有?圈的逻辑拓扑所需的时间。